#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=600;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn*maxn];
map<LL,LL>map1;
vector<LL>v;
bool cmp(LL A,LL B){
    return A>B;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  n=n*n;
  for(LL i=1;i<=n;i++) cin>>a[i],map1[a[i]]++;
  sort(a+1,a+1+n,cmp);
  for(LL i=1;i<=n;i++){
     if(map1.count(a[i])&&map1[a[i]]>0){
        v.push_back(a[i]);
        for(auto j:v){
            map1[__gcd(j,a[i])]-=2;
        }
     }
  }
  for(auto j:v){
    cout<<j<<" ";
  }
  cout<<"\n";
return 0;
}
